Derivation of a distributed algorithm for finding paths in directed networks
نویسندگان
چکیده
منابع مشابه
Derivation of a Distributed Algorithm for Finding Paths in Directed Networks
A distributed algorithm is developed that can be used to compute the topology of a network, given that each site starts with information about sites it is adjacent to, the network is strongly connected, and communication channels are unidirectional. The program is derived using assertional reasoning.
متن کاملDistributed Algorithms for Finding Central Paths in Tree Networks
Given a graph G = (V,E) and a path P , let d(v, P ) be the distance from vertex v ∈ V to path P . A path-center is a path which minimizes the eccentricity e(P ) = maxv∈V d(v, P ) such that for every path P ′ in G, e(P ) ≤ e(P ′), and for every subpath P ′′ ⊂ P , e(P ) < e(P ′′). Similarly, a core is a path which minimizes the distance d(P ) = ∑v∈V d(v, P ) such that for every path P ′ in G, d(P...
متن کاملA Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph
We present an algorithm for the k shortest simple path problem on weighted directed graphs (kSSP) that is based on Eppstein’s algorithm for a similar problem in which paths are allowed to contain cycles. In contrast to most other algorithms for kSSP, ours is not based on Yen’s algorithm [19] and does not solve replacement path problems. Its worst-case running time is on par with state-of-the-ar...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
K: A Directed On-The-Fly Algorithm for Finding the k Shortest Paths
We present a new algorithm, called K∗, for finding the k shortest paths between a designated pair of vertices in a given directed weighted graph. Compared to Eppstein’s algorithm, which is the most prominent algorithm for solving this problem, K∗ has two advantages. First, K∗ performs on-the-fly, which means that it does not require the graph to be explicitly available and stored in main memory...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1986
ISSN: 0167-6423
DOI: 10.1016/0167-6423(86)90016-x